Fast algorithm for discrete fractional Hadamard transform
نویسندگان
چکیده
منابع مشابه
Discrete fractional Hadamard transform
Hadamard transform is an important tool in discrete signal processing. In this paper, we define the discrete fractional Hadamard transform which is a generalized one. The development of discrete fractional Hadamard is based upon the same spirit of discrete fractional Fourier transform.
متن کاملFractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.
A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT...
متن کاملDiscrete fractional Fourier transform as a fast algorithm for evaluating the diffraction pattern of pulsed radiation.
A technique is proposed for computing the field radiated from a rectangular aperture. This technique, based on the discrete fractional Fourier transform, avoids the complexities of computing the diffraction pattern by the direct evaluation of the Fresnel integral. The advocated approach provides a fast and accurate computational tool, especially in the case of evaluating pulsed fields radiated ...
متن کاملDiscrete Fractional Hilbert Transform
The Hilbert transform plays an important role in the theory and practice of signal processing. A generalization of the Hilbert transform, the fractional Hilbert transform, was recently proposed, and it presents physical interpretation in the definition. In this paper, we develop the discrete fractional Hilbert transform, and apply the proposed discrete fractional Hilbert transform to the edge d...
متن کاملA fast algorithm for multiresolution discrete Fourier transform
The paper presents a fast algorithm for the calculation of a multiresolution discrete Fourier transform. The presented approach is based on the realization of the Fast Fourier Transform for each frequency resolution level. This algorithm allows reducing the number of complex multiplications and additions compared to the method consisting in the multiplication between the input signal expressed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2014
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-014-9862-8